搜索资源列表
StreamEdmondsKarp.rar
- 最大网络流问题 一个Edmonds-Karp算法，也就是广搜增广路径，用了16MS,A maximum network flow problem Edmonds-Karp algorithm, which is widely found augmented path, with a 16ms
edmonds_karp.rar
- 最大流实现程序，很好用，希望和大家分享~~,To achieve maximum flow process, very good, and would like to share ~ ~
M
- Implementation of Edmonds Karp algorithm that calculates maxFlow of graph. Input: For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, endin
Edmonds-Karp
- Edmonds-karp algorithm - A C++ program which returns the largest flow and flow through each edge.-Edmonds-karp algorithm- A C++ program which returns the largest flow and flow through each edge.
10
- This source code contains: -BFS algorithm on a graph -Edmonds Karp algorithm on a graph -minimal cut on a graph -disjunct paths in a graph.
connectivity
- 使用C++实现的一个计算图的连通度的程序 该算法使用Edmonds-Karp算法，基于网络流的计算而成。-this program is implemented by c++ and it is for the calculation of Graph Connectivity Degree,it uses Edmonds-Karp algorithm,which is famous for calculating network flow.
Edmonds-Karp
- Edmonds-Karp Algorithm for flow problem
DFSmat
- 最大流Edmonds-karp算法代码源，应用最短路径方法，相对于Ford算法简单-Edmonds- karp maximum flow algorithm source code, using the shortest path method, relative to the Ford algorithm is simple
EDMONDSKARP_2
- Edmonds Karp Algorithm for Maximum Flow
main
- SAP算法:求最大流有一种经典的算法，就是每次找增广路时用BFS找，保证找到的增广路是弧数最少的，也就是所谓的Edmonds-Karp算法。- SAP algorithm for the maximum flow is a classical algorithm, is each for augmenting path with BFS can guarantee the augmented way to find the minimum number of arcs, which i